search graph
英 [sɜːtʃ ɡræf]
美 [sɜːrtʃ ɡræf]
网络 查找图
双语例句
- Without that information, their contribution to the search graph will be limited.
没有这些信息，他们对图谱搜索的贡献就很有限。 - Concerning path search in the motion graph, this paper used the area between two curves as the target function and improved the strategy of incremental search and the strategy of branch and bound.
针对运动图上的路径搜索，提出了基于路径曲线所夹面积的目标函数并改进了分段搜索算法和剪枝策略。 - Perhaps just as important are fundamental algorithms like binary search, graph searching algorithms, sorting algorithms, and tree-based searches such as minimax.
二分搜索算法，图形搜索算法，排序算法，以及基于树的搜索算法比如极大极小树，这些基本的算法或许也是重要的基础。 - Introduces the algorithm using dynamic programming to search the shortest distance between two points in graph, and compares the complexity with ordinary method.
本文介绍了利用动态规划法来寻找图中任意两点间最短距离的算法，并将其时间复杂度与一般方法作了比较。 - It is necessary to search the lowest two levels of the cardinality structure graph while establishing a bound of different coalition with same cardinality and same value.
在同势同值情况下建立不同联盟的限界时，必须搜索势结构图的最底两层。 - Quick Backward Search Algorithm for Finding All Hamilton Circuits in Directed Graph
在有向图中寻找哈密顿回路的快速回溯法 - And the algorithms are just as important-from binary search to different sorts to graph traversals, a rockstar engineer must know and internalize the basics.
算法也同样重要，从二分查找到各种排序，到图形遍历，一位明星工程师必须知道并内在消化这些基础东西。 - Analysis and Implementation of Breadth-first Search Traversing Graph Algorithm
图的广度优先搜索遍历算法的分析与实现 - The traditional search algorithm has been improved based on the features of connected graph so that it can calculate operation steps of any specific scheduled task automatically.
针对连接图的这一特点，改进传统的搜索算法，使之可以针对调度任务自动计算操作步骤。 - We analyze the principle of Pollard rho-method and parallel collision search method using graph theory and algebra, and obtain important principle of directing the design of algorithms directed by this principle, we redesign the two algorithms, and achieve more efficient effect.
用代数和图论的方法深入分析了Pollardρ算法和并行碰撞算法的原理，获得了指导算法设计的重要原则，在这个原则的指导下，重新设计这两个算法，取得了更好的计算效果。 - A Mesh Search Algorithm On Plane Graph
平面图网孔搜索算法 - Solution of farmer's problem to pass through river by breadth-first search of graph
利用图的广度优先搜索解决农夫过河问题 - The characters of manual testing is reviewed and a testing model based on the search graph of knowledge point is given.
考察人工评测的特点，并提出一种基于知识点搜索图的评测模型。 - When unidirectional circuit exists in a network, the matrix algorithm for path and the search in directed graph will fail, formula for path number and the plotting of equilibrium graph don't fit too.
流体网络中含有单向回路时，将会导致通路的矩阵算法以及有向图的搜索失败，计算通路数的公式、平衡图的绘制方法也不适用。 - The cross-media search engine, based on the cross-media graph, calculates both the semantic and content level of the similarity between media objects and the query.
基于交叉参照图模型，我们实现了一个多模态交叉参照搜索引擎，用于综合计算媒体对象与查询之间在语义和内容层次上的相似度。 - This algorithm is based on the effective Genetic Algorithm ( GA) search method, and graph theory is introduced to assure deadlock-free.
此算法建立在遗传算法的基础上，运用图论算法来保证无死锁调度结果。 - In this paper, we present a system method aims at the key technique that needs solved in dimensional chain calculation, and made a in-depth research in auto search of dimensional chain graph, auto create of functional equations, calculation of functional equations etc.
本文针对尺寸链计算中需要解决的几个关键技术，提出了复杂尺寸链计算的系统方法，就尺寸链图自动搜索、尺寸链方程自动生成、功能方程的计算机求解等问题进行了深入的研究。 - An Automatic-testing Model Based on Search Graph
一种基于搜索图的自动评测模型 - First, the deadlock problem and its graph theory representation is introduced. Then based on the effective genetic algorithm ( GA) search method, the graph theory is introduced to assure deadlock_free.
为此首先介绍了死锁问题及其图论表示方法，然后在遗传算法的基础上，运用图论算法来保证无死锁的调度结果。 - A method is proposed to search for a suitable blank area in a graph of closed boundary by detecting if a circle is in touch with the closed boundary.
提出一种在封闭图形内，利用检测圆与封闭图形边界是否触碰的方法（简称圆形法），寻找适合的空白区域，适用于在已知图形上填写字符，确定新图形的位置。 - For the dynamic CDG matching, we first transform the CDG into the disordered label trees, and then design a matching algorithm with linear time complexity for the label tree based on the idea of breadth first search graph algorithm.
动态组件依赖图先被转化成无序标签树，然后借鉴图的宽度优先遍历方法，设计了一种线性时间复杂度的匹配算法。 - The heuristic Width priority search arithmetic is researched. Graph knowledge is mined through the concept of distance and fuzz Lattice Degree of Nearness.
并在其基础上研究了在网格中知识启发式宽度优先搜索算法，同时通过引入距离和频域模糊贴近度概念进行图形知识挖掘，形成网格故障知识发现模型。 - In the real world, many problems in technology, commerce, economy, biology and other fields can be abstracted into similarity search problems of a graph.
在现实世界中，有许多科技、商业、经济、生化等领域的问题可以抽象成图上的相似性搜索问题。 - The new way based on backtracking search transfers program code to program dependence graph ( PDG) according to node types and edge types.
该方法采用基于回溯搜索的子图同构算法，把程序源码按节点类型和边类型转换成程序依赖图。 - Based on this idea, this dissertation proposes document topology model, including undirected document topology and directed document topology and converts the similarity search problem of document into graph search problem.
基于这一思想，本文提出了文献拓扑图模型，其中包括无向文献拓扑图和有向文献拓扑图，将文献的相似性搜索问题转化为图搜索问题。 - The core of the algorithm is to cut, match and regroup captured motion data with the help of motion graph. But existing methods use slow algorithms to construct and search the motion graph, and thus can not meet the real time requirement.
算法的核心思想是利用运动图对捕获数据进行分割、匹配和重组，然而已有算法中运动图的构造利搜索算法效率低下，无法达到实时要求。 - In view of formal concept analysis of the feasibility in the topic search, the Concept Context Graph ( CCG) which is gotten from the concept lattice as the background knowledge to guide the focused crawler is a good innovation.
鉴于形式概念分析在主题搜索中的可行性，把从概念格转换来的背景图作为主体爬虫的知识背景来指导爬行是一个很好的创新。 - Subsequently, to obtain complete information flows and carry out covert channel path search effectively, information flow generation rules based on Control Flow Graph and the properties of information flow are formulated, and constrained reverse information flow graph search algorithm is designed.
其次，为了较完整地获取信息流和实现隐通道路径的有效搜索，制定了基于控制流图和信息流性质的信息流生成规则，设计了带约束的逆向信息流图搜索算法。 - And put forward relevant actions based on the movement of the cluster model, in order to reduce the search space, spanning tree algorithm proposed RPC node graph, and refinement of the merger of RPC nodes, node splitting and spanning tree balancing algorithm.
并提出了基于相关动作簇的运动模型，为了缩减搜索空间，提出RPC节点图生成树算法，并细化了RPC的节点合并，节点分裂和生成树平衡算法。 - Ochoa conducted a fitness landscapes analysis on a hyper-heuristic search space by using graph coloring heuristics for timetabling.
Ochoa在用图染色算法求解课程表问题时，对超启发式算法空间进行了适应度地貌分析。